CONTROLLING HUMAN FIXED-INTERVAL PERFORMANCE1
نویسندگان
چکیده
منابع مشابه
Interval-valued process data monitoring and controlling
Statistical process control, a recognized technique for improving quality and productivity, has been widely employed throughout various industries. The conventional Shewhart control charts are applicable only when the collected sample data are real-valued data. For the purpose of controlling uncertain information when interval-valued data inevitably appear in the manufacturing or service proces...
متن کاملControlling Pollution with Fixed Inspection Capacity
In this paper I model the optimal monitoring and enforcement strategy when inspection capacity is fixed by budget or manpower constraints. I adopt a leverage enforcement structure that classifies firms into two groups with different enforcement intensities. Optimal monitoring and enforcement requires effective allocation of the fixed number of inspections to the two groups. In each period, a fi...
متن کاملInterval censored regression with fixed effects
This paper considers estimation of a fixed-effects model with an interval-censored dependent variable. In each time period, the researcher observes the interval (with known endpoints) in which the dependent variable lies but not the value of the dependent variable itself. Two versions of the model are considered, a parametric model with logistic errors and a semiparametric model with errors hav...
متن کاملInterval Completion Is Fixed Parameter Tractable
We present an algorithm with runtime O(knm) for the following NP-complete problem [9, problem GT35]: Given an arbitrary graph G on n vertices and m edges, can we obtain an interval graph by adding at most k new edges to G? This resolves the long-standing open question [17, 7, 25, 14], first posed by Kaplan, Shamir and Tarjan, of whether this problem was fixed parameter tractable. The problem ha...
متن کاملUnit Interval Editing is Fixed-Parameter Tractable
Given a graph G and integers k1, k2, and k3, the unit interval editing problem asks whether G can be transformed into a unit interval graph by at most k1 vertex deletions, k2 edge deletions, and k3 edge additions. We give an algorithm solving this problem in time 2 logk) · (n+m), where k := k1 +k2 +k3, and n,m denote respectively the numbers of vertices and edges of G. Therefore, it is fixed-pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Experimental Analysis of Behavior
سال: 1969
ISSN: 0022-5002
DOI: 10.1901/jeab.1969.12-349